from typing import List


class Solution:
    def selectionSort(self, nums: List) -> List:
        if len(nums) < 2:
            return nums
        for i in range(0, len(nums)-1):
            for j in range(i, len(nums)):
                if nums[i] > nums[j]:
                    nums[i], nums[j] = nums[j], nums[i]
        return nums


if __name__ == '__main__':
    t = [3, 1, 5, -6, 7, 12, 2, 9, 10]
    x = Solution()
    x.selectionSort(t)
    print(t)
